Integrating Owicki–Gries for C11-Style Memory Models into Isabelle/HOL

Abstract Weak memory presents a new challenge for program verification and has resulted in the development of variety specialised logics. For C11-style models, our previous work shown that it is possible to extend Hoare logic Owicki–Gries reasoning verify correctness weak programs. The technique introduces set high-level assertions over C11 states together with basic Hoare-style axioms atomic statements (e.g. reads/writes), but retains all other standard proof obligations compound statements. This paper takes this line further by introducing first deductive environment Isabelle/HOL C11-like built on Nipkow Nieto’s encoding Isabelle theorem prover. We exemplify techniques several litmus tests from literature two non-trivial examples: Peterson’s algorithm read–copy–update adapted C11. examples we consider, outlines can be automatically discharged using existing tactics developed Nieto. benefit here programs written familiar pseudocode syntax embedded directly into program.